Efficient greedy algorithms for high-dimensional parameter spaces with applications to empirical interpolation and reduced basis methods
نویسندگان
چکیده
منابع مشابه
Efficient Greedy Algorithms for High-dimensional Parameter Spaces with Applications to Empirical Interpolation and Reduced Basis Methods
We propose two new algorithms to improve greedy sampling of high-dimensional functions. While the techniques have a substantial degree of generality, we frame the discussion in the context of methods for empirical interpolation and the development of reduced basis techniques for high-dimensional parametrized functions. The first algorithm, based on a saturation assumption of the error in the gr...
متن کاملLocally Adaptive Greedy Approximations for Anisotropic Parameter Reduced Basis Spaces
Reduced order models, in particular the reduced basis method, rely on empirically built and problem dependent basis functions that are constructed during an off-line stage. In the on-line stage, the precomputed problem-dependent solution space, that is spanned by the basis functions, can then be used in order to reduce the size of the computational problem. For complex problems, the number of b...
متن کاملConvergence Rates for Greedy Algorithms in Reduced Basis Methods
The reduced basis method was introduced for the accurate online evaluation of solutions to a parameter dependent family of elliptic partial differential equations. Abstractly, it can be viewed as determining a “good” n dimensional space Hn to be used in approximating the elements of a compact set F in a Hilbert space H. One, by now popular, computational approach is to find Hn through a greedy ...
متن کاملEfficient and Robust Parameter Tuning for Heuristic Algorithms
The main advantage of heuristic or metaheuristic algorithms compared to exact optimization methods is their ability in handling large-scale instances within a reasonable time, albeit at the expense of losing a guarantee for achieving the optimal solution. Therefore, metaheuristic techniques are appropriate choices for solving NP-hard problems to near optimality. Since the parameters of heuristi...
متن کاملGreedy Algorithms for Reduced Bases in Banach Spaces∗
Given a Banach space X and one of its compact sets F , we consider the problem of finding a good n dimensional space Xn ⊂ X which can be used to approximate the elements of F . The best possible error we can achieve for such an approximation is given by the Kolmogorov width dn(F)X . However, finding the space which gives this performance is typically numerically intractable. Recently, a new gre...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ESAIM: Mathematical Modelling and Numerical Analysis
سال: 2014
ISSN: 0764-583X,1290-3841
DOI: 10.1051/m2an/2013100